ADG: Annotated Dependency Graphs for Software Understanding
نویسندگان
چکیده
Dependency graphs such as call and data usage graphs are often used to study software systems and perform impact analysis during maintenance activities. These graphs show the present structure of the software system (e.g. In a compiler, an Optimizer function calling a Parser function). They fail to reveal details about the structure of the system that are needed to gain a better understanding. For example, traditional call graphs cannot give the rationale behind an Optimizer function calling Parser function. In this position paper, we advocate a new view on dependency graphs – Annotated Dependency Graphs (ADG). ADG can assist maintainers understand better the current structure of large software systems. We show an example of using an ADG to study Postgres, a large DBMS open source software system.
منابع مشابه
Dependency-Driven Distribution of Synchronous Programs
In this paper, we describe an automatic synthesis procedure that distributes synchronous programs on a set of desynchronized processing elements. Our distribution procedure consists of three steps: First, we translate the given synchronous program to synchronous guarded actions. Second, we analyze their data dependencies and represent them in a so-called action dependency graph (ADG). Third, th...
متن کاملAnalyzing Java Software by Combining Metrics and Program Visualization
Shimba, a prototype reverse engineering environment, has been built to support the understanding of Java software. Shimba uses Rigi and SCED to analyze, visualize, and explore the static and dynamic aspects, respectively, of the subject system. The static software artifacts and their dependencies are extracted from Java byte code and viewed as directed graphs using the Rigi reverse engineering ...
متن کاملParametrised dependency pairs for a general form of termination in annotated rewriting
We define a general form of termination, α-termination, for term rewrite systems with an annotation α. Standard termination and top-termination are particular instances. We present a variation on the dependency pair criterion of Arts and Giesl and prove that an α-annotated term rewrite system is α-terminating if and only there are no chains of α-dependency pairs. The α-dependency graphs can be ...
متن کاملEfficient Dependency Graph Matching with the IMS Open Corpus Workbench
State-of-the-art dependency representations such as the Stanford Typed Dependencies may represent the grammatical relations in a sentence as directed, possibly cyclic graphs. Querying a syntactically annotated corpus for grammatical structures that are represented as graphs requires graph matching, which is a non-trivial task. In this paper, we present an algorithm for graph matching that is ta...
متن کاملComment-based Concept Location over System Dependency Graphs
Software maintenance is one of the most expensive phases of software development and understanding a program is one of the most important tasks of software maintenance. Before making the change to the program, software engineers need to find the location, or locations, where the changes will be made, they need to understand the program. Real applications are huge, sometimes old, were written by...
متن کامل